Normal Monomodal Logics Can Simulate All Others
نویسندگان
چکیده
This paper shows that non{normal modal logics can be simulated by certain polymodal normal logics and that polymodal normal logics can be simulated by monomodal (normal) logics. Many properties of logics are shown to be re ected and preserved by such simulations. As a consequence many old and new results in modal logic can be derived in a straightforward way, sheding new light on the power of normal monomodal logic. Normal monomodal logics can simulate all others 1 This paper is dedicated to our teacher, Wolfgang Rautenberg x
منابع مشابه
Embeddings of Propositional Monomodal Logics
The aim of this paper is to investigate the expressibility of classical propositional monomodal logics. To this end, a notion of embedding of one logic into another is introduced, which is, roughly, a translation preserving theoremhood. This enables to measure the expressibility of a logic by a (finite or infinite) number of logics embeddable into it. This measure is calculated here for a large...
متن کاملThe Power of a Propositional Constant
Monomodal logic has exactly two maximally normal logics, which are also the only quasi-normal logics that are Post complete, and they are complete for validity in Kripke frames. Here we show that addition of a propositional constant to monomodal logic allows the construction of continuum many maximally normal logics that are not valid in any Kripke frame, or even in any complete modal algebra. ...
متن کاملAutomating Access Control Logics in Simple Type Theory with LEO-II
Garg and Abadi recently proved that prominent access control logics can be translated in a sound and complete way into modal logic S4. We have previously outlined how normal multimodal logics, including monomodal logics K and S4, can be embedded in simple type theory and we have demonstrated that the higher-order theorem prover LEO-II can automate reasoning in and about them. In this paper we c...
متن کاملOn Canonical Modal Logics That Are Not Elementarily Determined
There exist modal logics that are validated by their canonical frames but are not sound and complete for any elementary class of frames. Continuum many such bimodal logics are exhibited, including one of each degree of unsolvability, and all with the finite model property. Monomodal examples are also constructed that extend K4 and are related to the proof of non-canonicity of the McKinsey axiom.
متن کاملOn the Complexity of Fragments of Modal Logics
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show that: a) the satisfiability problem of sets of Horn modal clauses with modal depth bounded by k ≥ 2 in the modal logics K4 and KD4 is PSPACE-complete, in K is NP-complete; b) the satisfiability problem of modal formulas ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 64 شماره
صفحات -
تاریخ انتشار 1999